Multi-agent Reinforcement Learning for Decentralized Stable Matching
نویسندگان
چکیده
In the real world, people/entities usually find matches independently and autonomously, such as finding jobs, partners, roommates, etc. It is possible that this search for starts with no initial knowledge of environment. We propose use a multi-agent reinforcement learning (MARL) paradigm spatially formulated decentralized two-sided matching market independent autonomous agents. Having agents acting makes our environment very dynamic uncertain. Moreover, lack preferences other have to explore interact discover their own through noisy rewards. think setting better approximates world we study usefulness MARL approach it. Along conventional stable case where strictly ordered preferences, check applicability incomplete lists ties. investigate results stability, level instability (for unstable results), fairness. Our mostly yields fair outcomes.
منابع مشابه
Dynamic Safe Interruptibility for Decentralized Multi-Agent Reinforcement Learning
In reinforcement learning, agents learn by performing actions and observing their 1 outcomes. Sometimes, it is desirable for a human operator to interrupt an agent 2 in order to prevent dangerous situations from happening. Yet, as part of their 3 learning process, agents may link these interruptions, that impact their reward, to 4 specific states and deliberately avoid them. The situation is pa...
متن کاملFully Decentralized Multi-Agent Reinforcement Learning with Networked Agents
We consider the problem of fully decentralized multi-agent reinforcement learning (MARL), where the agents are located at the nodes of a time-varying communication network. Specifically, we assume that the reward functions of the agents might correspond to different tasks, and are only known to the corresponding agent. Moreover, each agent makes individual decisions based on both the informatio...
متن کاملDecentralized multi-agent reinforcement learning in average-reward dynamic DCOPs
Researchers have introduced the Dynamic Distributed Constraint Optimization Problem (Dynamic DCOP) formulation to model dynamically changing multi-agent coordination problems, where a dynamic DCOP is a sequence of (static canonical) DCOPs, each partially different from the DCOP preceding it. Existing work typically assumes that the problem in each time step is decoupled from the problems in oth...
متن کاملMulti-Agent Reinforcement Learning
This thesis presents a novel approach to provide adaptive mechanisms to detect and categorise Flooding-Base DoS (FBDoS) and Flooding-Base DDoS (FBDDoS) attacks. These attacks are generally based on a flood of packets with the intention of overfilling key resources of the target, and today the attacks have the capability to disrupt networks of almost any size. To address this problem we propose ...
متن کاملCoordinated Multi-Agent Learning for Decentralized POMDPs
In many multi-agent applications such as distributed sensor nets, a network of agents act collaboratively under uncertainty and local interactions. Networked Distributed POMDP (ND-POMDP) provides a framework to model such cooperative multi-agent decision making. Existing work on ND-POMDPs has focused on offline techniques that require accurate models, which are usually costly to obtain in pract...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-87756-9_24